On the Complexity of Local Search in Unconstrained Quadratic Binary Optimization
نویسنده
چکیده
We show by construction that the procedure of local search for the problem of finding a local optimum of a quadratic pseudo-boolean function takes exponential time in the worst case, regardless of the neighbor selection and tie-breaking rules.
منابع مشابه
Heuristic algorithms for the bipartite unconstrained 0-1 quadratic programming problem
We study the Bipartite Unconstrained 0-1 Quadratic Programming Problem (BQP) which is a relaxation of the Unconstrained 0-1 Quadratic Programming Problem (QP). Applications of the BQP include mining discrete patterns from binary data, approximating matrices by rank-one binary matrices, computing cut-norm of a matrix, and solving optimization problems such as maximum weight biclique, bipartite m...
متن کاملSeveral versions of the devour digest tidy-up heuristic for unconstrained binary quadratic problems
The unconstrained binary quadratic optimization problem (UQP) is known to be NP-hard and due to its computational challenge and application potential, it becomes more and more considered and involved by the recent research studies, including both exact and heuristic solution approaches. Our work is in line with that of Glover, Alidaee, Rego and Kochenberger (2002) who proposed one pass heuristi...
متن کاملSeveral versions of Devour Digest Tidy-up Heuristic for Large-Scale Unconstrained Binary Quadratic Problem
The unconstrained binary quadratic optimization problem (UQP) is known to be NP-hard and due to its computational challenge and application potential, it becomes more and more considered and involved by the recent research studies, including both exact and heuristic solution approaches. Our work is in line with that of Glover, Alidaee, Rego and Kochenberger (2002) who proposed one pass heuristi...
متن کاملNeighborhood Combination for Unconstrained Binary Quadratic Programming
Using the Unconstrained Binary Quadratic Programming (UBQP) problem as a case study, we present an experimental analysis of neighborhood combinations for local search based metaheuristic algorithms. In this work, we use one-flip and two-flip moves and investigate combined neighborhoods with these two moves within two metaheuristic algorithms. The goal of the analysis is to help understand why a...
متن کاملFast 2-flip move evaluations for binary unconstrained quadratic optimization problems
We provide a method for efficiently evaluating 2-flip moves that simultaneously change the values of two 0-1 variables in search methods for binary unconstrained quadratic optimization problems (UQP). We extend a framework recently proposed by the authors for creating efficient evaluations of 1-flip moves to yield a method requiring significantly less computation time than a direct sequential a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM Journal on Optimization
دوره 26 شماره
صفحات -
تاریخ انتشار 2016